Feasible Real Random Access Machines

Neural Random-Access Machines

In this paper, we propose and investigate a new neural network architecture called Neural Random Access Machine. It can manipulate and dereference pointers to an external variable-size random-access memory. The model is trained from pure input-output examples using backpropagation. We evaluate the new model on a number of simple algorithmic tasks whose solutions require pointer manipulation and...

Relative Cost Random Access Machines

Fast Simulation of Turing Machines by Random Access Machines

Random-Access Machines and the Extended Church-Turing Thesis

We show that a random-access machine (RAM) can simulate any effective algorithm with only constant overhead of time, thereby supporting the Extended Church-Turing Thesis.

Tables Should Be Sorted (On Random Access Machines)

We consider the problem of storing an n element subset S of a universe of size m, so that membership queries (is x ∈ S?) can be answered efficiently. The model of computation is a random access machine with the standard instruction set (direct and indirect adressing, conditional branching, addition, subtraction, and multiplication). We show that if s memory registers are used to store S, where ...